-
1 split
A n1 lit (in fabric, garment) déchirure f ; (in rock, wood) fissure f, crevasse f ; ( in skin) crevasse f ;2 (in party, movement, alliance) scission f (in de) ; ( stronger) rupture f (between entre ; in dans ; into dans) ; a three-way split in the party executive une scission en trois groupes de la direction du parti ;3 ( share-out) (of money, profits, jobs) partage m ; a (four-way) split of the profits un partage (en quatre) des bénéfices ;6 Fin surtout US marge f différentielle, différence f ; income/wage split éventail m des revenus/salaires.1 (cut, slit) fendre [wood, log, rock, slate, seam] (in, into en) ; déchirer [fabric, garment] ; to split one's lip se fendre la lèvre ; to split the atom fissionner l'atome ; [lightning, thunder, noise] déchirer [sky, silence] ;2 ( cause dissent) diviser, provoquer une scission dans [party, movement, alliance] ; to split the vote diviser l'électorat ; the dispute has split the alliance in two/into two factions le conflit a divisé l'alliance en deux/en deux factions ; the committee was (deeply) split on or over this issue la commission était (extrêmement) divisée or partagée sur cette question ;4 ( share) partager [cost, payment] (between entre) ; shall we split a bottle of wine (between us)? si on partageait une bouteille de vin? ; to split sth three/four ways partager qch en trois/en quatre [profits, cost] ;5 Ling to split an infinitive introduire un adverbe au milieu d'un infinitif, entre ‘to’ et le verbe ;6 Comput fractionner [window].1 [wood, log, rock, slate] se fendre (in, into en) ; [fabric, garment] se déchirer ; [seam] se défaire ; to split in(to) two [stream, road] se diviser en deux ; my head's splitting fig j'ai horriblement mal à la tête ;2 gen, Pol [party, movement, alliance] se diviser ; ( stronger) se scinder ; the leadership split on ou over (the question of) the voting system la direction était divisée à propos du système électoral ; to split along party lines se séparer en fonction des différents partis ;5 ○ ( leave) filer ○.to split the difference couper la poire en deux ; to split one's sides ○ (laughing) se tordre de rire.■ split off:▶ split off [branch, piece, end] se détacher (from de) ; [path] bifurquer ; [political group] faire scission ; [company] se séparer (from de) ;▶ split [sth] off détacher [branch, piece] ; to split sth off from détacher qch de [branch, piece] ; séparer qch de [company, section, department].■ split open:■ split up:▶ split up [band, couple, members, parents] se séparer ; [crowd, demonstrators] se disperser ; [alliance, consortium] éclater ; [federation] se scinder (into en) ; to split up with quitter, se séparer de [partner, husband, girlfriend] ; to split up into groups of five se mettre en groupes de cinq ;▶ split [sb] up séparer [friends, partners, group members] (from de) ; everyone tried to split the couple up tout le monde a essayé de les écarter l'un de l'autre ; to split the children up into groups répartir les enfants en petits groupes ;▶ split [sth] up, split up [sth] partager, répartir [money, profits, work] (into en) ; diviser [area, group] (into en) ; to split a novel up into chapters diviser un roman en chapitres ; to split sth up into its component parts séparer les différentes parties qui composent qch.
См. также в других словарях:
Path (computing) — A path is the general form of a file or directory name, giving a file s name and its unique location in a file system. Paths point to their location using a string of characters signifying directories, each path component separated by a… … Wikipedia
Path loss — (or path attenuation) is the reduction in power density (attenuation) of an electromagnetic wave as it propagates through space. Path loss is a major component in the analysis and design of the link budget of a telecommunication system.This term… … Wikipedia
Path quality analysis — Path quality analysis: In a communications path, an analysis that (a) includes the overall evaluation of the component quality measures, the individual link quality measures, and the aggregate path quality measures, and (b) is performed by… … Wikipedia
Component Object Model — Not to be confused with COM file. Component Object Model (COM) is a binary interface standard for software componentry introduced by Microsoft in 1993. It is used to enable interprocess communication and dynamic object creation in a large range… … Wikipedia
Path computation element — Routing is the process of finding a suitable route for conveying data between a source and one or a set of destination. Routing can be subject to a set of constraints, like QoS, policy, or price. Constraint based path computation is a strategic… … Wikipedia
Component-based software engineering — A simple example of two components expressed in UML 2.0. The checkout component, responsible for facilitating the customer s order, requires the card processing component to charge the customer s credit/debit card (functionality that the latter… … Wikipedia
Identity component — In mathematics, the identity component of a topological group G is the connected component G0 of G that contains the identity element of the group. Similarly, the identity path component of a topological group G is the path component of G that… … Wikipedia
Connected component (graph theory) — A graph with three connected components. In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices. For example,… … Wikipedia
Eulerian path — In graph theory, an Eulerian path is a path in a graph which visits each edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the … Wikipedia
Littelmann path model — In mathematics, the Littelmann path model is a combinatorial device due to Peter Littelmann for computing multiplicities without overcounting in the representation theory of symmetrisable Kac Moody algebras. Its most important application is to… … Wikipedia
Strongly connected component — Graph with strongly connected components marked A directed graph is called strongly connected if there is a path from each vertex in the graph to every other vertex. In particular, this means paths in each direction; a path from a to b and also a … Wikipedia
